Dedekind Zeta Functions and the Complexity of Hilbert’s Nullstellensatz

نویسنده

  • J. Maurice Rojas
چکیده

Let HN denote the problem of determining whether a system of multivariate polynomials with integer coefficients has a complex root. It has long been known that HN∈P =⇒ P=NP and, thanks to recent work of Koiran, it is now known that the truth of theGeneralized Riemann Hypothesis (GRH) yields the implication HN 6∈P =⇒ P 6=NP. We show that the assumption of GRH in the latter implication can be replaced by either of two more plausible hypotheses from analytic number theory. The first is an effective short interval Prime Ideal Theorem with explicit dependence on the underlying field, while the second can be interpreted as a quantitative statement on the higher moments of the zeroes of Dedekind zeta functions. In particular, both assumptions can still hold even if GRH is false. We thus obtain a new application of Dedekind zero estimates to computational algebraic geometry. Along the way, we also apply recent explicit algebraic and analytic estimates, some due to Silberman and Sombra, which may be of independent interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universality of Polynomial Positivity and a Variant of Hilbert’s 17th Problem

We observe that the decision problem for the ∃ theory of real closed fields (RCF) is simply reducible to the decision problem for RCF over a connective-free ∀ language in which the only relation symbol is a strict inequality. In particular, every ∃ RCF sentence φ can be settled by deciding a proposition of the form “polynomial p (which is a sum of squares) takes on strictly positive values over...

متن کامل

Combinatorial Nullstellensatz

The Combinatorial Nullstellensatz is a theorem about the roots of a polynomial. It is related to Hilbert’s Nullstellensatz. Established in 1996 by Alon et al. [4] and generalized in 1999 by Alon [2], the Combinatorial Nullstellensatz is a powerful tool that allows the use of polynomials to solve problems in number theory and graph theory. This article introduces the Combinatorial Nullstellensat...

متن کامل

Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract)

Two important algebraic proof systems are the Nullstellensatz system [1] and the polynomial calculus [2] (also called the Gröbner system). The Nullstellensatz system is a propositional proof system based on Hilbert’s Nullstellensatz, and the polynomial calculus (PC) is a proof system which allows derivations of polynomials, over some £eld. The complexity of a proof in these systems is measured ...

متن کامل

Values of Zeta Functions at Negative Integers, Dedekind Sums and Toric Geometry

In the present paper, we study relations among special values of zeta functions of real quadratic fields, properties of generalized Dedekind sums and Todd classes of toric varieties. The main theme of the paper is the use of toric geometry to explain in a conceptual way properties of the values of zeta functions and Dedekind sums, as well as to provide explicit computations. Both toric varietie...

متن کامل

Evaluation of Dedekind Sums, Eisenstein Cocycles, and Special Values of L-functions

We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications. First, we show how to express special values of partial zeta functions associated to totally real number fields in terms of these sums via the Eisenstein cocycl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008